f(int*a,int*b){return*a-*b;}
r[400000];
main(n,i,s,t,a)
{
	for(;scanf("%d",&n)&&n;printf("%d\n",a+1))
	{
		for(i=0;i<n;scanf("%d",r+i++));
		qsort(r,n,4,f);
		for(a=t=s=i=0;i<n;a=a>s?a:s,t=r[i++])
			if(t==r[i])s++;
			else s=0;
	}
}
